Linear Cryptanalysis of Reduced-Round Simeck Using Super Rounds
نویسندگان
چکیده
The Simeck family of lightweight block ciphers was proposed by Yang et al. in 2015, which combines the design features NSA-designed Simon and Speck. Previously, we use linear cryptanalysis using super-rounds to increase efficiency implementing Matsui’s second algorithm achieved good results on all variants Simon. improved attacks result from observation that, after four rounds encryption, one bit left half state cipher depends only 17 key bits (19 for larger cipher). We were able follow a similar approach, Simeck, with an improvement 32 48 relaxing previous constraint single active bit, multiple instead. In this paper present against Simeck: 19-rounds 32/64, 28-rounds 48/96, 34-rounds 64/128, often direct recovery full master without repeating attack over rounds. also verified 8, 10, 12 32/64.
منابع مشابه
Linear Cryptanalysis of Reduced-Round SIMECK Variants
SIMECK is a family of 3 lightweight block ciphers designed by Yang et al. They follow the framework used by Beaulieu et al. from the United States National Security Agency (NSA) to design SIMON and SPECK. A cipher in this family with K-bit key and N -bit block is called SIMECKN/K. We show that the security of this block cipher against linear cryptanalysis is not as good as its predecessors SIMO...
متن کاملLinear cryptanalysis of reduced-round SPECK
Article history: Received 15 September 2015 Accepted 5 November 2015 Available online 2 December 2015 Communicated by S.M. Yiu
متن کاملImproved Linear Cryptanalysis of Reduced-Round MIBS
MIBS is a 32-round lightweight block cipher with 64-bit block size and two different key sizes, namely 64-bit and 80-bit keys. Bay et al. provided the first impossible differential, differential and linear cryptanalyses of MIBS. Their best attack was a linear attack on the 18-round MIBS-80. In this paper, we significantly improve their attack by discovering more approximations and mounting Herm...
متن کاملMultidimensional Linear Cryptanalysis of Reduced Round Serpent
Various authors have previously presented di erent approaches how to exploit multiple linear approximations to enhance linear cryptanalysis. In this paper we present a new truly multidimensional approach to generalise Matsui’s Algorithm 1. We derive the statistical framework for it and show how to calculate multidimensional probability distributions based on correlations of onedimensional linea...
متن کاملLinear Cryptanalysis of Round Reduced SIMON
SIMON is a family of lightweight block ciphers that was proposed by U.S National Security Agency (NSA). A cipher in this family with K-bit key and N -bit block is called SIMON N/K. In this paper we analyze the security of SIMON against linear cryptanalysis. We present several linear characteristics for all variants of SIMON with reduced number of rounds. Our best linear characteristic covers SI...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography
سال: 2023
ISSN: ['2410-387X']
DOI: https://doi.org/10.3390/cryptography7010008